Convergence of series of dependent φ-subgaussian random variables

The almost sure convergence of weighted sums of φ-subgaussian m-acceptable random variables is investigated. As corollaries, the main results are applied to the case of negatively dependent and m-dependent subgaussian random variables. Finally, an application to random Fourier series is presented.     

Modelling by a planar map: Lyapunov-type numbers in the presence of spiral points

Lyapunov-type numbers are usually defined for diffeomorphisms with a smooth invariant manifold. We consider here the case of a planar diffeomorphism with an invariant curve that contains spiral points. The limits defining the Lyapunov-type numbers are shown to exist. Numerical results for the delayed logistic map illustrate the analysis.     

Banach空间的Chung-Teicher型大数律

设{Xn，n≥1}是实可分Banach空间独立随机变量，讨论了在弱大数律的假设下使得Chung-Teicher型强大数律也成立，即bn^-1｜｜∑k=1^n（Xk-EXkI（｜｜Xk｜｜≤bk））｜｜→^p0当且仅当bn^-1｜｜∑中k=1^n（Xk-EXkI（｜｜Xk｜｜≤bk））｜｜→^a.s.0.     

Milnor invariants for spatial graphs

Link-homotopy has been an active area of research for knot theorists since its introduction by Milnor in the 1950s. We introduce a new equivalence relation on spatial graphs called component-homotopy, which reduces to link-homotopy in the classical case. Unlike previous attempts at generalizing link-homotopy to spatial graphs, our new relation allows analogues of some standard link-homotopy results and invariants.In particular we can define a type of Milnor group for a spatial graph under component-homotopy, and this group determines whether or not the spatial graph is splittable. More surprisingly, we will also show that whether the spatial graph is splittable up to component-homotopy depends only on the link-homotopy class of the links contained within it. Numerical invariants of the relation will also be produced.     

Generating non-jumping numbers recursively

Let r?2 be an integer. A real number α∈[0,1) is a jump for r if there is a constant c>0 such that for any ε>0 and any integer m where m?r, there exists an integer n₀ such that any r-uniform graph with n>n₀ vertices and density ?α+ε contains a subgraph with m vertices and density ?α+c. It follows from a fundamental theorem of Erd?s and Stone that every α∈[0,1) is a jump for r=2. Erd?s asked whether the same is true for r?3. Frankl and Rödl gave a negative answer by showing some non-jumping numbers for every r?3. In this paper, we provide a recursive formula to generate more non-jumping numbers for every r?3 based on the current known non-jumping numbers.     

Chamber behavior of double Hurwitz numbers in genus 0

We study double Hurwitz numbers in genus zero counting the number of covers CP¹→CP¹ with two branching points with a given branching behavior. By the recent result due to Goulden, Jackson and Vakil, these numbers are piecewise polynomials in the multiplicities of the preimages of the branching points. We describe the partition of the parameter space into polynomiality domains, called chambers, and provide an expression for the difference of two such polynomials for two neighboring chambers. Besides, we provide an explicit formula for the polynomial in a certain chamber called totally negative, which enables us to calculate double Hurwitz numbers in any given chamber as the polynomial for the totally negative chamber plus the sum of the differences between the neighboring polynomials along a path connecting the totally negative chamber with the given one.     

群体决策随机偏爱数映射的若干性质

1引言近年来,群体决策在社会选择、福利、经济和军事等领域得到广泛应用,从而其理论研究越来越被人们所重视.20世纪中叶,K.J,Arrow提出了偏爱公理系和不可能性定理,并     

Finding more perfect matchings in leapfrog fullerenes

We use some recent results on the existence of long cycles in leapfrog fullerenes to establish new exponential lower bounds on the number of perfect matchings in such graphs. The new bounds are expressed in terms of Fibonacci numbers.     

A combinatorial approach to jumping particles: The parallel TASEP

In this article, we continue the combinatorial study of models of particles jumping on a row of cells which we initiated with the standard totally asymmetric simple exclusion process or TASEP (Duchi and Schaeffer, Journal of Combinatorial Theory, Series A, 110(2005), 1–29). We consider here the parallel TASEP, in which particles can jump simultaneously. On the one hand, the interest in this process comes from highway traffic modeling: it is the only solvable special case of the Nagel‐Schreckenberg automaton, the most popular model in that context. On the other hand, the parallel TASEP is of some theoretical interest because the derivation of its stationary distribution, as appearing in the physics literature, is harder than that of the standard TASEP. We offer here an elementary derivation that extends the combinatorial approach we developed for the standard TASEP. In particular, we show that this stationary distribution can be expressed in terms of refinements of Catalan numbers. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

Riordan阵与含有Genocchi数的一些恒等式

In this paper, using generating functions and Riordan arrays, we get some identities relating Genocchi numbers with Stirling numbers and Cauchy numbers.